Proximal operator of quotient functions with application to a feasibility problem in query optimization

نویسندگان

  • Guido Moerkotte
  • Martin J. Montag
  • Audrey Repetti
  • Gabriele Steidl
چکیده

In this paper we determine the proximity functions of the sum and the maximum of componentwise (reciprocal) quotients of positive vectors. For the sum of quotients, denoted by Q1, the proximity function is just a componentwise shrinkage function which we call q-shrinkage. This is similar to the proximity function of the l1-norm which is given by componentwise soft shrinkage. For the maximum of quotients Q∞, the proximal function can be computed by first order primal dual methods involving epigraphical projections. The proximity functions of Qν , ν = 1,∞ are applied to solve convex problems of the form argminx Qν( Ax b ) subject to x ≥ 0, 1x ≤ 1. Such problems are of interest in selectivity estimation for cost-based query optimizers in database management systems.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Hybrid Proximal Point Algorithm for Resolvent operator in Banach Spaces

Equilibrium problems have many uses in optimization theory and convex analysis and which is why different methods are presented for solving equilibrium problems in different spaces, such as Hilbert spaces and Banach spaces. The purpose of this paper is to provide a method for obtaining a solution to the equilibrium problem in Banach spaces. In fact, we consider a hybrid proximal point algorithm...

متن کامل

An improved particle swarm optimization with a new swap operator for team formation problem

Formation of effective teams of experts has played a crucial role in successful projects especially in social networks. In this paper, a new particle swarm optimization (PSO) algorithm is proposed for solving a team formation optimization problem by minimizing the communication cost among experts. The proposed algorithm is called by improved particle optimization with new swap operator (IPSONSO...

متن کامل

On the optimization of Dombi non-linear programming

Dombi family of t-norms includes a parametric family of continuous strict t-norms, whose members are increasing functions of the parameter. This family of t-norms covers the whole spectrum of t-norms when the parameter is changed from zero to infinity. In this paper, we study a nonlinear optimization problem in which the constraints are defined as fuzzy relational equations (FRE) with the Dombi...

متن کامل

Multiobjective Imperialist Competitive Evolutionary Algorithm for Solving Nonlinear Constrained Programming Problems

Nonlinear constrained programing problem (NCPP) has been arisen in diverse range of sciences such as portfolio, economic management etc.. In this paper, a multiobjective imperialist competitive evolutionary algorithm for solving NCPP is proposed. Firstly, we transform the NCPP into a biobjective optimization problem. Secondly, in order to improve the diversity of evolution country swarm, and he...

متن کامل

Solving proximal split feasibility problems without prior knowledge of operator norms

Abstract In this paper our interest is in investigating properties and numerical solutions of Proximal Split feasibility Problems. First, we consider the problem of finding a point which minimizes a convex function f such that its image under a bounded linear operator A minimizes another convex function g. Based on an idea introduced in [9], we propose a split proximal algorithm with a way of s...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • J. Computational Applied Mathematics

دوره 285  شماره 

صفحات  -

تاریخ انتشار 2015